منابع مشابه
Linear programming on SS-fuzzy inequality constrained problems
In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar family of t-norms. Schweizer-Sklar family of t-norms is a parametric family of continuous t-norms, which covers the whole spectrum of t-norms when the parameter is changed...
متن کاملMatrix Games, Linear Programming, and Linear Approximation
qi = 1, pA ≥ v ≥ Aq. The number v is known as the value of game. The pair (p, q) is known as an equilibrium for the matrix game. As usual, x ≥ 0 means that every entry of the vector x is ≥ 0. We write y ≤ t for a vector y and a number t if every entry of y is ≤ t. We go even further in abusing notation, denoting by y− t the vector obtaining from y by subtracting t from every entry. Similarly we...
متن کاملChance-constrained games: A mathematical programming approach
We consider a two player bimatrix game where the entries of the payoff matrices are random variables. We formulate this problem as a chance-constrained game by considering that the payoff of each player is defined using a chance constraint. We consider the case where the entries of the payoff matrices are independent normal/Cauchy random variables. We show a one-to-one correspondence between a ...
متن کاملInteger Linear Programming Models for Constrained Clustering
We address the problem of building a clustering as a subset of a (possibly large) set of candidate clusters under user-defined constraints. In contrast to most approaches to constrained clustering, we do not constrain the way observations can be grouped into clusters, but the way candidate clusters can be combined into suitable clusterings. The constraints may concern the type of clustering (e....
متن کاملAlfa-cut based linear programming methodology for constrained matrix games with payoffs of trapezoidal fuzzy numbers
The purpose of this paper is to develop an effective methodology for solving constrained matrix games with payoffs of trapezoidal fuzzy numbers (TrFNs), which are a type of two-person non-cooperative games with payoffs expressed by TrFNs and players’ strategies being constrained. In this methodology, it is proven that any Alfa-constrained matrix game has an interval-type value and hereby any co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1953
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.39.7.639